Dimensionally Exponential Lower Bounds on the $L^p$ Norms of the Spherical Maximal Operator for Cartesian Powers of Finite Trees and Related Graphs
نویسنده
چکیده
Let T be a finite tree graph, TN be the Cartesian power graph of T , and dN be the graph distance metric on TN . Also let Sr (x) := {v ∈ T N : d (x, v) = r} be the sphere of radius r centered at x and M be the spherical maximal averaging operator on TN given by Mf(x) := sup r≥0 S N r (x) 6=∅ 1 |Sr (x)| ∣
منابع مشابه
Harmonic Analysis on Graphs: Maximal Bounds for Cartesian Powers of Finite Graphs
My research in graph theory focuses on asymptotic maximal bounds for Cartesian powers of finite graphs. This line of inquiry was opened up by [4], in which the authors proved that the maximal spherical averaging operator on the N -dimensional hypercube K 2 satisfies a bound in the L 2 norm independent of the dimension N . That is, if Sk(x) := {y : d(x, y) = k} in the graph distance metric on K ...
متن کاملThe second geometric-arithmetic index for trees and unicyclic graphs
Let $G$ be a finite and simple graph with edge set $E(G)$. The second geometric-arithmetic index is defined as $GA_2(G)=sum_{uvin E(G)}frac{2sqrt{n_un_v}}{n_u+n_v}$, where $n_u$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$. In this paper we find a sharp upper bound for $GA_2(T)$, where $T$ is tree, in terms of the order and maximum degree o...
متن کاملSharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs
In $1994,$ degree distance of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the multiplicative version of degree distance and multiplicative ver...
متن کاملSome lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملOn the super domination number of graphs
The open neighborhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $Dsubseteq V(G)$, we define $overline{D}=V(G)setminus D$. A set $Dsubseteq V(G)$ is called a super dominating set of $G$ if for every vertex $uin overline{D}$, there exists $vin D$ such that $N(v)cap overline{D}={u}$. The super domination number of $G$ is the minimum car...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1509.02843 شماره
صفحات -
تاریخ انتشار 2015